Partition logics of automata
نویسندگان
چکیده
We introduce a new type of orthomodular poset which is obtained by considering the pasting of partitions of a set. These partition logics appear in the experimental investigation of finite automata and can be related to certain quantum mechanical systems.
منابع مشابه
Product of Partition Logics, Orthoalgebras and Automata
We attempt to define a coupled system consisting of two partition logics and we introduce a product of partition logics. These partition logics have a close connection with Moore and Mealy type automata. We show how the coupled system of two automata is connected with the product of partition logics, and persent some illustrative examples.
متن کاملPartition Logics, Orthoalgebras and Automata
We investigate the orthoalgebras of certain non-Boolean models which have a classical realization. Our particular concern will be the partition logics arising from the investigation of the empirical propositional structure of Moore and Mealy type automata.
متن کاملIrreducibility on General Fuzzy Automata
The aim of this paper is the study of a covering of a max-mingeneral fuzzy automaton by another, admissible relations, admissiblepartitions of a max-min general fuzzy automaton,$tilde{delta}$-orthogonality of admissible partitions, irreduciblemax-min general fuzzy automata. Then we obtain the relationshipsbetween them.
متن کاملMaximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata
It is highly desirable for a computational model to have a logic characterization like in the seminal work of Büchi that connects MSO with finite automata. For example, weighted automata are the quantitative extension of finite automata for computing functions over words and they can be naturally characterized by a subfragment of weighted logic introduced by Droste and Gastin. Recently, cost re...
متن کاملTransformation of BL-general Fuzzy Automata
In this paper, we prove that any BL-general fuzzy automaton (BL-GFA) and its quotient have the same behavior. In addition, we obtain the minimal quotient BL-GFA and minimal quotient transformation of the BL-GFA, considering the notion of maximal admissible partition. Furthermore, we show that the number of input symbols and time complexity of the minimal quotient transformation of a BL-GFA are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012